Trade Oo between Compression and Search times in Compact Suux Array ?

Suux array is a widely used full-text index that allows fast searches on the text. It is constructed by sorting all suuxes of the text in the lexicographic order and storing pointers to the suuxes in this order. Binary search is used for fast searches on the suux array. Compact suux array is a compressed form of the suux array that still allows binary searches, but the search times are also dependent on the compression. In this paper, we answer some open questions concerning the compact suux array, and study practical issues, such as the trade oo between compression and search times, and show how to reduce the space requirement of the construction. Experimental results are provided in comparison with other search methods. The results show that usually the size of a compact suux array is less than twice the size of the text, while the search times are still comparable to those of suux arrays.